Fast Random Walk with Restart over a Signed Graph
نویسندگان
چکیده
منابع مشابه
Fast Inbound Top-K Query for Random Walk with Restart
Random walk with restart (RWR) is widely recognized as one of the most important node proximity measures for graphs, as it captures the holistic graph structure and is robust to noise in the graph. In this paper, we study a novel query based on the RWR measure, called the inbound top-k (Ink) query. Given a query node q and a number k, the Ink query aims at retrieving k nodes in the graph that h...
متن کاملScaling Random Walk with Restart over Dynamic Networks
Random Walk with Restart (RWR) is an appealing measure of proximity between nodes based on network topologies. As real graphs are becoming larger and subject to minor changes, it is rather cost-inhibitive to recompute proximities from scratch. Existing method utilizes LU decomposition and degree reordering heuristics. As a result, it yields O(|V |) time and O(|V |) memory to compute all (|V |) ...
متن کاملFast Random Walk Graph Kernel
Random walk graph kernel has been used as an important tool for various data mining tasks including classification and similarity computation. Despite its usefulness, however, it suffers from the expensive computational cost which is at least O(n) or O(m) for graphs with n nodes and m edges. In this paper, we propose Ark, a set of fast algorithms for random walk graph kernel computation. Ark is...
متن کاملA Random Walk with Exponential Travel Times
Consider the random walk among N places with N(N - 1)/2 transports. We attach an exponential random variable Xij to each transport between places Pi and Pj and take these random variables mutually independent. If transports are possible or impossible independently with probability p and 1-p, respectively, then we give a lower bound for the distribution function of the smallest path at point log...
متن کاملFast and Accurate Random Walk with Restart on Dynamic Graphs with Guarantees
ABSTRACT Given a time-evolving graph, how can we track similarity between nodes in a fast and accurate way, with theoretical guarantees on the convergence and the error? Random Walk with Restart (RWR) is a popular measure to estimate the similarity between nodes and has been exploited in numerous applications. Many real-world graphs are dynamic with frequent insertion/deletion of edges; thus, t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Society for e-Business Studies
سال: 2015
ISSN: 2288-3908
DOI: 10.7838/jsebs.2015.20.2.155